perm filename OUTLIN[206,JMC] blob
sn#005333 filedate 1971-01-05 generic text, type T, neo UTF8
00100 COMPUTER SCIENCE 206 FALL 1970
00200
00300 INTRODUCTION TO COMPUTATION WITH SYMBOLIC EXPRESSIONS
00400
00500 1. Basic LISP.
00600 a. S-expressions, lists, and the representation of
00700 symbolic expressions in the machine.
00800 b. The basic functions of LISP, conditional
00900 expressions, and recursive functions, functional
01000 arguments,
01100 m-expression notation,
01200 c. Examples and exercises.
01300
01400 2. Applications of basic LISP.
01500 a. Operations on sets.
01600 b. Tree search and path optimization.
01610 i. Directed and undirected graphs, have we
01620 been here before, the block puzzle, pre-existing and generated
01630 as we go graphs,
01700 c. Operations on algebraic expressions.
01800 d. Canonical forms.
01900 d. Examples and exercises.
02000
02100 3. The LISP 1.5 system.
02200 a. The program feature.
02300 b. The compiler.
02400 c. Numbers.
02500 d. Arrays.
02600 e. I-O.
02700 f. Good LISP programming. Depth of recursion,
02800 iteration and recursion,
02900
03000 4. Syntax directed computation and input-output.
03100 a. An elementary syntax directed system.
03200 i. Use of the system.
03300 ii. Construction of the system.
03400 iii. Variants of the system.
03500 b. Quam I-O.
03600 c. Advanced syntax directed systems.
03700 d. Examples and exercises.
03800
03900 5. Computation with Algebraic expressions.
04000 a. Differentiation.
04100 b. Equation solver.
04200 c. Operations with symbolic matrices, power series,
04300 differential equations, integrals.
04400 d. MATHLAB.
04500 e. REDUCE.
04600 f. Possible projects.
04700
04800 6. Introduction to theory of computation.
04900 a. The universal function.
05000 b. Undecidable problems.
05100 c. Transformation of conditional expressions.
05200 e. Recursion induction.
05300 f. Abstract syntax.
05400 g. Research problems.
05500
05600 7. The LISP system on the PDP-10.
05700 a. Representation of information.
05800 b. Coding conventions.
05900 c. The I-O system.
06000 d. The compiler.
06100 e. Directions for improvements.
06200 f. LAP.
06300 g. Garbage collection.
06400
06500 8. Optimal compiling.
06600 a. A compiler for arithmetic expressions.
06700 b. Optimizing arithmetic expressions.
06800 c. Compiling Boolean and conditional expressions.
06900 d. Compiling LISP recursive functions.
07000 e. A LISP machine?
07010
07020 9. More applications.
07030 a. Tree search - impure
07040 b. Game playing.